public class Solution1143 {
    public int longestCommonSubsequence(String text1, String text2) {
        int[][] f=new int[text1.length()+1][text2.length()+1];
        for (int i=1;i<=text1.length();i++){
            for (int j=1;j<=text2.length();j++){
                if (text1.charAt(i-1)==text2.charAt(j-1)){
                    f[i][j]=f[i-1][j-1]+1;
                }else{
                    f[i][j]=Math.max(f[i-1][j],f[i][j-1]);
                }
            }
        }
        return f[text1.length()][text2.length()];
    }

    public static void main(String[] args) {
        System.out.println(new Solution1143().longestCommonSubsequence("abcde","ace"));
    }
}
